Multi-type display calculus for propositional dynamic logic
نویسندگان
چکیده
We introduce a multi-type display calculus for Propositional Dynamic Logic (PDL). This calculus is complete w.r.t. PDL, and enjoys Belnap-style cut-elimination and subformula property.
منابع مشابه
Multi-type display calculus for dynamic epistemic logic
In the present paper, we introduce a multi-type display calculus for dynamic epistemic logic, which we refer to as Dynamic Calculus. The displayapproach is suitable to modularly chart the space of dynamic epistemic logics on weaker-than-classical propositional base. The presence of types endows the language of the Dynamic Calculus with additional expressivity, allows for a smooth proof-theoreti...
متن کاملSequential Dynamic Logic
We introduce a substructural propositional calculus of Sequential Dynamic Logic (SDL) that subsumes a propositional part of dynamic predicate logic (DPL), and is shown to be expressively equivalent to propositional dynamic logic (PDL). Completeness of the calculus with respect to the intended relational semantics is established.
متن کاملTool support for reasoning in display calculi
We present a tool for reasoning in and about propositional sequent calculi. One aim is to support reasoning in calculi that contain a hundred rules or more, so that even relatively small pen and paper derivations become tedious and error prone. As an example, we implement the display calculus D.EAK of dynamic epistemic logic. Second, we provide embeddings of the calculus in the theorem prover I...
متن کاملDynamic sequent calculus for the logic of Epistemic Actions and Knowledge
Dynamic Logics (DLs) form a large family of nonclassical logics, and perhaps the one enjoying the widest range of applications. Indeed, they are designed to formalize change caused by actions of diverse nature: updates on the memory state of a computer, displacements of moving robots in an environment, measurements in models of quantum physics, belief revisions, knowledge updates, etc. In each ...
متن کاملA strongly complete proof system for propositional dynamic logic
Propositional dynamic logic (PDL) is complete but not compact. As a consequence, strong completeness (the property j= ' ) ` ') does not hold for the standard nitary axiomatisation. In this paper, we present an in nitary proof system of PDL and prove strong completeness. The result is extended to epistemic logic with common knowledge.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Log. Comput.
دوره 26 شماره
صفحات -
تاریخ انتشار 2016